package com.clps.algorithm.chapter14.爬楼梯的最少成本;

public class 爬楼梯的最少成本_02 {
    public  int minCostClimbingStairs(int[] cost){
        int len = cost.length;
        int[] dp = new int[len];
        dp[0] = cost[0];
        dp[1] = cost[1];

        for (int i = 2; i <len; i++) {
            dp[i] = Math.min(dp[i-2],dp[i-1])+cost[i];
        }

        return  Math.min(dp[len -2],dp[len -1]);
    }
}
